Another variation on the common subexpression problem
نویسندگان
چکیده
منابع مشابه
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction can be effected in linear time. It is used to save storage in implementations of functional programming languages, as well as in symbolic manipulation and computer a/gebra systems. In compiling, the compaction problem i...
متن کاملILP Modelling of the Common Subexpression Sharing Problem
Subexpression sharing is an important implementation issue when one data is multiplied with many constants or a sum of products is computed. By modelling the subexpression sharing problem using integer linear programming (ILP) an optimal solution can be found. Further, the model can be directly incorporated with the design of algorithms that have linear design constraints, e.g., linear-phase FI...
متن کاملCommon Subexpression Induction
SIMD (Single Instruction stream, Multiple Data stream) computers can only execute the exact same instruction across all processing elements. This paper presents a new compiler optimization that transforms multiple distinct code threads so that they have as many instructions in common as possible, hence, SIMD execution time is minimized. For example, SIMD “parallel if” statements typically take ...
متن کاملCommon Subexpression Isolation in Multiple Query Optimization
The simultaneous optimization of multiple queries submitted to a database system may lead to substantial savings over the current approach of optimizing each query separately. Isolating common subexpressions in multiple queries and treating their execution as a sharable resource are important prerequisites . This chapter presents techniques for recognizing , supporting , and exploiting common s...
متن کاملMatrix compression by common subexpression elimination
In this report a method for common subexpression elimination in matrices is explored. The method is applied to several types of matrices occurring in numerical simulations. In all cases, the cost of a matrix-vector multiplication is reduced by a significant amount. The amount of storage required for the eliminated matrices is also less than that required for the original matrices. When the prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90379-8